Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus
نویسندگان
چکیده
We give a simple intuitionistic completeness proof of Kripke semantics with constant domain for intuitionistic logic with implication and universal quantification. We use a cut-free intuitionistic sequent calculus as formal system and by combining soundness with completeness, we obtain an executable cut-elimination procedure. The proof, which has been formalised in the Coq proof assistant, easily extends to the case of the absurdity connective using Kripke models with exploding nodes.
منابع مشابه
A Lambda-Calculus Structure Isomorphic to Gentzen-Style Sequent Calculus Structure
We consider a-calculus for which applicative terms have no longer the form (:::((u u1) u2)::: un) but the form (u u1; :::;un]), for which u1; :::;un] is a list of terms. While the structure of the usual-calculus is isomorphic to the structure of natural deduction, this new structure is isomorphic to the structure of Gentzen-style sequent calculus. To express the basis of the isomorphism, we con...
متن کاملA Gentzen-style sequent calculus of constructions with expansion rules
A Gentzen-style L-formulation of the calculus of constructions is presented and proved equivalent to a natural deduction formulation based on that of [6]. The L-rules corresponding to the conversion rules of the natural deduction system are expansion rules. Cut elimination follows from the equivalence to the natural deduction formulation and the normalization theorem for the latter.
متن کاملGeneralised elimination rules and harmony
Standard natural deduction rules for Int (intuitionistic predicate logic) in the style of Gentzen and Prawitz are presumed to be familiar. The theory of cut-elimination for sequent calculus rules is very clear; whether a derivation in a sequent calculus is cut-free or not is easily defined, according to the presence or absence of instances of the Cut rule. Normality of a (natural) deduction is ...
متن کاملA resource-sensitive logic of agency
We study a fragment of Intuitionistic Linear Logic combined with non-normal modal operators. Focusing on the minimal modal logic, we provide a Gentzen-style sequent calculus as well as a semantics in terms of Kripke resource models. We show that the proof theory is sound and complete with respect to the class of minimal Kripke resource models. We also show that the sequent calculus allows cut e...
متن کاملSufficient conditions for cut elimination with complexity analysis
Sufficient conditions for first order based sequent calculi to admit cut elimination by a Schütte-Tait style cut elimination proof are established. The worst case complexity of the cut elimination is analysed. The obtained upper bound is parameterized by a quantity related with the calculus. The conditions are general enough to be satisfied by a wide class of sequent calculi encompassing, among...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009